A Production Scheduling System for Batch Plants
نویسندگان
چکیده
منابع مشابه
A MILP Scheduling Model for Multi-stage Batch Plants
Abstract In the current work, a new precedence-based mixed integer linear programming (MILP) scheduling framework, based on a continuous-time representation, is developed for the scheduling in multi-stage batch plants. Advantages and special features of the proposed scheduling model are highlighted through several instances of two base case studies. Results are analyzed and further criticized t...
متن کاملA Petri Nets-Based Scheduling Methodology for Multipurpose Batch Plants
This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Diff...
متن کاملDynamic scheduling in multiproduct batch plants
This work introduces a novel MILP formulation for reactive scheduling of multiproduct batch plants to optimally generate updated schedules due to the occurrence of unforeseen events. It can also be used to improve a non-optimal production schedule before it is executed. The approach is based on a continuous-time problem representation that takes into account the schedule in progress, the update...
متن کاملOptimal Batch Production for a Single Machine System with Accumulated Defectives and Random Rate of Rework
In this paper we consider an imperfect production system which produces good and defective items and assume that defective items can be reworked. Due to the nature of rework process we do not restrict the rework rate to be equal to normal production rate or constant and assume that it is a random variable with an arbitrary distribution function. We also assume as it is true in most real world s...
متن کاملGreedy Algorithm for Scheduling Batch Plants with Sequence-Dependent Changeovers
This paper presents a new algorithm for the near optimal scheduling of multistage batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable when solved with full-space approaches or poor solutions result. We use decomposition on the entire set of orders and derive the complete schedule in several iterations, by inserting a couple of orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1993
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.29.843